Based on the timing constraints event model of rtl ( real time logic ) , the compiling algorithms for timing constraints event transform the problem of how to detect timing constraints event to the problem of how to find negative cycle in weighted directed graph , which is named as constraints graph . by simplifying constraints graph , the efficient detecting algorithms for timing constraints event have been developed , which not only has good time complexity but also can find events that violate timing constraints as early as possible . in order to verify the event detecting methods based on dynamic rules and to check its efficiency in application , experiment schemes are designed and performed on the implemented prototype system in linux environment 帶時間約束事件的編譯算法以rtl ( realtimelogic )事件模型為基礎,將帶時間約束事件的檢測轉化為在帶權值的有向圖(此即受限圖)中尋找負圈的問題,它通過化簡受限圖得到最小有效約束集;運行時事件檢測算法在最小有效約束集上檢查事件的時間約束,不但有較好的執行效率,而且能盡早地發現違反時間約束的事件。